Using the incompressibility method to obtain local lemma results for Ramsey-type problems

نویسنده

  • Pascal Schweitzer
چکیده

We reveal a connection between the incompressibility method and the Lovász local lemma in the context of Ramsey theory. We obtain bounds by repeatedly encoding objects of interest and thereby compressing strings. The method is demonstrated on the example of van der Waerden numbers. It applies to lower bounds of Ramsey numbers, large transitive subtournaments and other Ramsey phenomena as well.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zarankiewicz Numbers and Bipartite Ramsey Numbers

The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...

متن کامل

Ramsey goodness and beyond

In a seminal paper from 1983, Burr and Erd1⁄2os started the systematic study of Ramsey numbers of cliques vs. large sparse graphs, raising a number of problems. In this paper we develop a new approach to such Ramsey problems using a mix of the Szemerédi regularity lemma, embedding of sparse graphs, Turán type stability, and other structural results. We give exact Ramsey numbers for various clas...

متن کامل

The Canonical Ramsey Theorem and Computability Theory

Using the tools of computability theory and reverse mathematics, we study the complexity of two partition theorems, the Canonical Ramsey Theorem of Erdös and Rado, and the Regressive Function Theorem of Kanamori and McAloon. Our main aim is to analyze the complexity of the solutions to computable instances of these problems in terms of the Turing degrees and the arithmetical hierarchy. We succe...

متن کامل

A VARIATIONAL APPROACH TO THE EXISTENCE OF INFINITELY MANY SOLUTIONS FOR DIFFERENCE EQUATIONS

The existence of infinitely many solutions for an anisotropic discrete non-linear problem with variable exponent according to p(k)–Laplacian operator with Dirichlet boundary value condition, under appropriate behaviors of the non-linear term, is investigated. The technical approach is based on a local minimum theorem for differentiable functionals due to Ricceri. We point out a theorem as a spe...

متن کامل

3-Uniform hypergraphs of bounded degree have linear Ramsey numbers

Chvátal, Rödl, Szemerédi and Trotter [1] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. We prove that the same holds for 3-uniform hypergraphs. The main new tool which we prove and use is an embedding lemma for 3-uniform hypergraphs of bounded maximum degree into suitable 3-uniform ‘pseudo-random’ hypergraphs. keywords: hypergraphs; regularity lemm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 109  شماره 

صفحات  -

تاریخ انتشار 2009